Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
نویسندگان
چکیده
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality are based on the fitness landscape, we emphasize the explicit relation between genotypes and phenotypes. Statistical measures are demonstrated to reliably predict locality properties of selected decoder-based EAs for the multidimensional knapsack problem. Empirical results indicate that (i) strong locality is a necessary condition for high performance, (ii) the concept of heuristic bias also strongly affects solution quality, and (iii) it is important to maintain population diversity, e.g. by phenotypic duplicate elimination.
منابع مشابه
The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties are static and consider only parts of the complex interactions within an EA, and sometimes, these techniques give misleading results. We suggest an explicit analysis of the dynamic behavior, emphasizing the effects of ...
متن کاملEmpirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
Our main aim is to provide guidelines and practical help for the design of appropriate representations and operators for evolutionary algorithms (EAs). For this purpose, we propose techniques to obtain a better understanding of various effects in the interplay of the representation and the operators. We study six different representations and associated variation operators in the context of a s...
متن کاملOn the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms
Premature convergence is a serious problem in many applications of evolutionary algorithms (EAs), since it decreases the EA’s chance to reach new high-quality regions of the search space and hence degrades the overall performance. In particular decoder-based EAs are frequently susceptible to premature convergence due to their encoding redundancy. Our comparison of four decoder-based EAs for the...
متن کاملMotif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs
One of the major challenges in the field of evolutionary algorithms (EAs) is to characterise which kinds of problems are easy and which are not. Researchers have been attracted to predict the behaviour of EAs in different domains. We introduce fitness landscape networks (FLNs) that are formed using operators satisfying specific conditions and define a new predictive measure that we call motif d...
متن کاملMulti-dimensional Knapsack Problems
This chapter reviews our recent work on applying hybrid collaborative techniques that integrate Branch and Bound (B&B) and Memetic Algorithms (MAs) in order design effective heuristics for the Multidimensional Knapsack Problem (MKP). To this end, let us recall that Branch and Bound (B&B) [1] is an exact algorithm for finding optimal solutions to combinatorial problems, that, basically works by ...
متن کامل